Frequent universality criterion and densities
نویسندگان
چکیده
منابع مشابه
Universality and The Criterion d in Quantum Key Generation
The common security criterion d in quantum key distribution is taken to solve the universal composability problem in quantum key distribution as well as providing good general quantitative security guarantee. In this paper it is shown that these are a result of an invalid interpretation of d. The general security significance of d is analyzed in detail. The related issues of universality and at...
متن کاملA practical criterion for positivity of transition densities
We establish a simple criterion for locating points where the transition density of a degenerate diffusion is strictly positive. Throughout, we assume that the diffusion satisfies a stochastic differential equation (SDE) on R d with additive noise and polynomial drift. In this setting, we will see that it is often that case that local information of the flow, e.g. the Lie algebra generated by t...
متن کاملDensities, spectral densities and modality
This paper considers the problem of specifying a simple approximating density function for a given data set (x1, . . . , xn). Simplicity is measured by the number of modes but several different definitions of approximation are introduced. The taut string method is used to control the numbers of modes and to produce candidate approximating densities. Refinements are introduced that improve the l...
متن کاملCriterion for universality-class-independent critical fluctuations: example of the two-dimensional Ising model.
Order parameter fluctuations for the two-dimensional Ising model in the region of the critical temperature are presented. A locus of temperatures T(*) (L) and a locus of magnetic fields B(*) (L) are identified, for which the probability density function is similar to that for the two-dimensional XY model in the spin wave approximation. The characteristics of the fluctuations along these points ...
متن کاملVisibly pushdown automata on trees: universality and u-universality
An automaton is universal if it accepts every possible input. We study the notion of u-universality, which asserts that the automaton accepts every input starting with u. Universality and u-universality are both EXPTIME-hard for non-deterministic tree automata. We propose efficient antichain-based techniques to address these problems for visibly pushdown automata operating on trees. One of our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ergodic Theory and Dynamical Systems
سال: 2019
ISSN: 0143-3857,1469-4417
DOI: 10.1017/etds.2019.103